0.12/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.12 % Command : run_E %s %d THM 0.12/0.33 % Computer : n007.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1440 0.12/0.33 % WCLimit : 180 0.12/0.33 % DateTime : Thu Jul 4 07:39:54 EDT 2024 0.12/0.33 % CPUTime : 0.20/0.49 Running higher-order theorem proving 0.20/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.LLyONiQ3WF/E---3.1_14955.p 0.20/0.51 # Version: 3.2.0-ho 0.20/0.51 # Preprocessing class: HSMSSMSSMLSNHSN. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.51 # Starting new_ho_10_cnf2 with 900s (5) cores 0.20/0.51 # Starting post_as_ho3 with 180s (1) cores 0.20/0.51 # Starting post_as_ho11 with 180s (1) cores 0.20/0.51 # Starting full_lambda_8 with 180s (1) cores 0.20/0.51 # post_as_ho11 with pid 15102 completed with status 0 0.20/0.51 # Result found by post_as_ho11 0.20/0.51 # Preprocessing class: HSMSSMSSMLSNHSN. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.51 # Starting new_ho_10_cnf2 with 900s (5) cores 0.20/0.51 # Starting post_as_ho3 with 180s (1) cores 0.20/0.51 # Starting post_as_ho11 with 180s (1) cores 0.20/0.51 # No SInE strategy applied 0.20/0.51 # Search class: HGHNS-FFMS00-SHSSMFNN 0.20/0.51 # partial match(2): HGHNF-FFSS00-SHSSMFNN 0.20/0.51 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.20/0.51 # Starting new_ho_10 with 98s (1) cores 0.20/0.51 # new_ho_10 with pid 15106 completed with status 0 0.20/0.51 # Result found by new_ho_10 0.20/0.51 # Preprocessing class: HSMSSMSSMLSNHSN. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.51 # Starting new_ho_10_cnf2 with 900s (5) cores 0.20/0.51 # Starting post_as_ho3 with 180s (1) cores 0.20/0.51 # Starting post_as_ho11 with 180s (1) cores 0.20/0.51 # No SInE strategy applied 0.20/0.51 # Search class: HGHNS-FFMS00-SHSSMFNN 0.20/0.51 # partial match(2): HGHNF-FFSS00-SHSSMFNN 0.20/0.51 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.20/0.51 # Starting new_ho_10 with 98s (1) cores 0.20/0.51 # Preprocessing time : 0.002 s 0.20/0.51 # Presaturation interreduction done 0.20/0.51 0.20/0.51 # Proof found! 0.20/0.51 # SZS status Theorem 0.20/0.51 # SZS output start CNFRefutation 0.20/0.51 thf(decl_sort1, type, mindex: $tType). 0.20/0.51 thf(decl_sort2, type, mworld: $tType). 0.20/0.51 thf(decl_22, type, mrel: mindex > mworld > mworld > $o). 0.20/0.51 thf(decl_23, type, '#c': mindex). 0.20/0.51 thf(decl_24, type, '#b': mindex). 0.20/0.51 thf(decl_25, type, '#a': mindex). 0.20/0.51 thf(decl_26, type, mactual: mworld). 0.20/0.51 thf(decl_27, type, mlocal: (mworld > $o) > $o). 0.20/0.51 thf(decl_28, type, mnot: (mworld > $o) > mworld > $o). 0.20/0.51 thf(decl_33, type, mbox: mindex > (mworld > $o) > mworld > $o). 0.20/0.51 thf(decl_34, type, mdia: mindex > (mworld > $o) > mworld > $o). 0.20/0.51 thf(decl_40, type, a0: mworld > $o). 0.20/0.51 thf(decl_45, type, esk1_0: mworld). 0.20/0.51 thf(decl_46, type, esk2_0: mworld). 0.20/0.51 thf(decl_47, type, esk3_0: mworld). 0.20/0.51 thf(mlocal_def, axiom, ((mlocal)=(^[X1:mworld > $o]:((X1 @ mactual)))), file('/export/starexec/sandbox2/tmp/tmp.LLyONiQ3WF/E---3.1_14955.p', mlocal_def)). 0.20/0.51 thf(mnot_def, axiom, ((mnot)=(^[X2:mworld > $o, X3:mworld]:(~((X2 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.LLyONiQ3WF/E---3.1_14955.p', mnot_def)). 0.20/0.51 thf(mbox_def, axiom, ((mbox)=(^[X5:mindex, X1:mworld > $o, X3:mworld]:(![X6:mworld]:(((mrel @ X5 @ X3 @ X6)=>(X1 @ X6)))))), file('/export/starexec/sandbox2/tmp/tmp.LLyONiQ3WF/E---3.1_14955.p', mbox_def)). 0.20/0.51 thf(mdia_def, axiom, ((mdia)=(^[X5:mindex, X1:mworld > $o, X3:mworld]:(?[X6:mworld]:(((mrel @ X5 @ X3 @ X6)&(X1 @ X6)))))), file('/export/starexec/sandbox2/tmp/tmp.LLyONiQ3WF/E---3.1_14955.p', mdia_def)). 0.20/0.51 thf(con, conjecture, (mlocal @ (mbox @ '#b' @ (mnot @ (mdia @ '#a' @ (mdia @ '#b' @ (mbox @ '#c' @ (mnot @ a0))))))), file('/export/starexec/sandbox2/tmp/tmp.LLyONiQ3WF/E---3.1_14955.p', con)). 0.20/0.51 thf('mrel_#c_universal', axiom, ![X3:mworld, X6:mworld]:((mrel @ '#c' @ X3 @ X6)), file('/export/starexec/sandbox2/tmp/tmp.LLyONiQ3WF/E---3.1_14955.p', 'mrel_#c_universal')). 0.20/0.51 thf(axiom_a0, axiom, (mlocal @ a0), file('/export/starexec/sandbox2/tmp/tmp.LLyONiQ3WF/E---3.1_14955.p', axiom_a0)). 0.20/0.51 thf(c_0_7, plain, ((mlocal)=(^[Z0/* 3 */:mworld > $o]:((Z0 @ mactual)))), inference(fof_simplification,[status(thm)],[mlocal_def])). 0.20/0.51 thf(c_0_8, plain, ((mnot)=(^[Z0/* 19 */:mworld > $o, Z1:mworld]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot_def])). 0.20/0.51 thf(c_0_9, plain, ((mbox)=(^[Z0/* 19 */:mindex, Z1:mworld > $o, Z2:mworld]:(![X6:mworld]:(((mrel @ Z0 @ Z2 @ X6)=>(Z1 @ X6)))))), inference(fof_simplification,[status(thm)],[mbox_def])). 0.20/0.51 thf(c_0_10, plain, ((mdia)=(^[Z0/* 19 */:mindex, Z1:mworld > $o, Z2:mworld]:(?[X6:mworld]:(((mrel @ Z0 @ Z2 @ X6)&(Z1 @ X6)))))), inference(fof_simplification,[status(thm)],[mdia_def])). 0.20/0.51 thf(c_0_11, negated_conjecture, ~(![X16:mworld]:(((mrel @ '#b' @ mactual @ X16)=>~(?[X15:mworld]:(((mrel @ '#a' @ X16 @ X15)&?[X14:mworld]:(((mrel @ '#b' @ X15 @ X14)&![X13:mworld]:(((mrel @ '#c' @ X14 @ X13)=>~(a0 @ X13))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[con]), c_0_7]), c_0_8]), c_0_9]), c_0_10])])). 0.20/0.51 thf(c_0_12, negated_conjecture, ![X55:mworld]:(((mrel @ '#b' @ mactual @ esk1_0)&((mrel @ '#a' @ esk1_0 @ esk2_0)&((mrel @ '#b' @ esk2_0 @ esk3_0)&(~(mrel @ '#c' @ esk3_0 @ X55)|~(a0 @ X55)))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])])). 0.20/0.51 thf(c_0_13, plain, ![X95:mworld, X96:mworld]:((mrel @ '#c' @ X95 @ X96)), inference(variable_rename,[status(thm)],['mrel_#c_universal'])). 0.20/0.51 thf(c_0_14, plain, (a0 @ mactual), inference(apply_def,[status(thm)],[axiom_a0, c_0_7])). 0.20/0.51 thf(c_0_15, negated_conjecture, ![X3:mworld]:((~((mrel @ '#c' @ esk3_0 @ X3))|~((a0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_12])). 0.20/0.51 thf(c_0_16, plain, ![X3:mworld, X6:mworld]:((mrel @ '#c' @ X3 @ X6)), inference(split_conjunct,[status(thm)],[c_0_13])). 0.20/0.51 thf(c_0_17, plain, (a0 @ mactual), inference(split_conjunct,[status(thm)],[c_0_14])). 0.20/0.51 thf(c_0_18, negated_conjecture, ![X3:mworld]:(~((a0 @ X3))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15, c_0_16])])). 0.20/0.51 thf(c_0_19, plain, ($false), inference(sr,[status(thm)],[c_0_17, c_0_18]), ['proof']). 0.20/0.51 # SZS output end CNFRefutation 0.20/0.51 # Parsed axioms : 45 0.20/0.51 # Removed by relevancy pruning/SinE : 0 0.20/0.51 # Initial clauses : 40 0.20/0.51 # Removed in clause preprocessing : 25 0.20/0.51 # Initial clauses in saturation : 15 0.20/0.51 # Processed clauses : 7 0.20/0.51 # ...of these trivial : 0 0.20/0.51 # ...subsumed : 0 0.20/0.51 # ...remaining for further processing : 7 0.20/0.51 # Other redundant clauses eliminated : 0 0.20/0.51 # Clauses deleted for lack of memory : 0 0.20/0.51 # Backward-subsumed : 0 0.20/0.51 # Backward-rewritten : 1 0.20/0.51 # Generated clauses : 1 0.20/0.51 # ...of the previous two non-redundant : 1 0.20/0.51 # ...aggressively subsumed : 0 0.20/0.51 # Contextual simplify-reflections : 0 0.20/0.51 # Paramodulations : 0 0.20/0.51 # Factorizations : 0 0.20/0.51 # NegExts : 0 0.20/0.51 # Equation resolutions : 0 0.20/0.51 # Disequality decompositions : 0 0.20/0.51 # Total rewrite steps : 1 0.20/0.51 # ...of those cached : 0 0.20/0.51 # Propositional unsat checks : 0 0.20/0.51 # Propositional check models : 0 0.20/0.51 # Propositional check unsatisfiable : 0 0.20/0.51 # Propositional clauses : 0 0.20/0.51 # Propositional clauses after purity: 0 0.20/0.51 # Propositional unsat core size : 0 0.20/0.51 # Propositional preprocessing time : 0.000 0.20/0.51 # Propositional encoding time : 0.000 0.20/0.51 # Propositional solver time : 0.000 0.20/0.51 # Success case prop preproc time : 0.000 0.20/0.51 # Success case prop encoding time : 0.000 0.20/0.51 # Success case prop solver time : 0.000 0.20/0.51 # Current number of processed clauses : 5 0.20/0.51 # Positive orientable unit clauses : 4 0.20/0.51 # Positive unorientable unit clauses: 0 0.20/0.51 # Negative unit clauses : 1 0.20/0.51 # Non-unit-clauses : 0 0.20/0.51 # Current number of unprocessed clauses: 9 0.20/0.51 # ...number of literals in the above : 58 0.20/0.51 # Current number of archived formulas : 0 0.20/0.51 # Current number of archived clauses : 2 0.20/0.51 # Clause-clause subsumption calls (NU) : 0 0.20/0.51 # Rec. Clause-clause subsumption calls : 0 0.20/0.51 # Non-unit clause-clause subsumptions : 0 0.20/0.51 # Unit Clause-clause subsumption calls : 0 0.20/0.51 # Rewrite failures with RHS unbound : 0 0.20/0.51 # BW rewrite match attempts : 1 0.20/0.51 # BW rewrite match successes : 1 0.20/0.51 # Condensation attempts : 7 0.20/0.51 # Condensation successes : 0 0.20/0.51 # Termbank termtop insertions : 3922 0.20/0.51 # Search garbage collected termcells : 1537 0.20/0.51 0.20/0.51 # ------------------------------------------------- 0.20/0.51 # User time : 0.005 s 0.20/0.51 # System time : 0.003 s 0.20/0.51 # Total time : 0.008 s 0.20/0.51 # Maximum resident set size: 2108 pages 0.20/0.51 0.20/0.51 # ------------------------------------------------- 0.20/0.51 # User time : 0.008 s 0.20/0.51 # System time : 0.004 s 0.20/0.51 # Total time : 0.012 s 0.20/0.51 # Maximum resident set size: 1756 pages 0.20/0.51 % E---3.1 exiting 0.20/0.52 % E exiting 0.20/0.52 EOF